Finishing flows quickly with preemptive scheduling
نویسندگان
چکیده
منابع مشابه
NCP: Finishing Flows Even More Quickly
The transmission control protocol (TCP) is the major transport layer protocol in the Internet today. TCP and its variants have the drawback of not knowing the explicit rate share of flows at bottleneck links. The Rate Control Protocol (RCP) is a major clean slate congestion control protocol which has been recently proposed to address these drawbacks. RCP tries to get explicit knowledge of flow ...
متن کاملA Preemptive multimode resource constrained project scheduling model with cash flows
Resource constrained project scheduling problem is one of the most important issues in project planning and management. The objective function of this problem is to minimize the completion time of a project. When there is budget constraint or high risk for investment, using the criteria such as cash flows is so important. The development of computer systems and processors makes it possible to t...
متن کاملPreemptive Scheduling with Rejection
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the jobs and thereby incur jobdependent penalties for each rejected job, and he must construct a schedule for the remaining jobs so as to optimize the preemptive makespan on the m machines plus the sum of the penalties of th...
متن کاملPreemptive Scheduling with Position Costs
This paper is devoted to basic scheduling problems in which the scheduling cost of a job is not a function of its completion time. Instead, the cost is derived from the integration of a cost function over the time intervals on which the job is processed. This criterion is specially meaningful when job preemption is allowed. Polynomial algorithms are presented to solve some special cases includi...
متن کاملPreemptive multiprocessor scheduling with rejection
The problem of online multiprocessor scheduling with rejection was introduced by Bartal, Leonardi, Marchetti-Spaccamela, Sgall and Stougie 4]. They show that for this problem the competitive ratio is 1 + 2:61803, where is the golden ratio. A modiied model of multipro-cessor scheduling with rejection is presented where preemption is allowed. For this model, it is shown that better performance is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGCOMM Computer Communication Review
سال: 2012
ISSN: 0146-4833
DOI: 10.1145/2377677.2377710